A greedy algorithm for finding a large 2‐matching on a random cubic graph
نویسندگان
چکیده
منابع مشابه
A greedy algorithm for finding a large 2-matching on a random cubic graph
A 2-matching of a graph G is a spanning subgraph with maximum degree two. The size of a 2-matching U is the number of edges in U and this is at least n − κ(U) where n is the number of vertices of G and κ denotes the number of components. In this paper, we analyze the performance of a greedy algorithm 2greedy for finding a large 2-matching on a random 3-regular graph. We prove that with high pro...
متن کاملA GPU Algorithm for Greedy Graph Matching
Greedy graph matching provides us with a fast way to coarsen a graph during graph partitioning. Direct algorithms on the CPU which perform such greedy matchings are simple and fast, but offer few handholds for parallelisation. To remedy this, we introduce a fine-grained shared-memory parallel algorithm for maximal greedy matching, together with an implementation on the GPU, which is faster (spe...
متن کاملAN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
متن کاملFinite groups admitting a connected cubic integral bi-Cayley graph
A graph is called integral if all eigenvalues of its adjacency matrix are integers. Given a subset $S$ of a finite group $G$, the bi-Cayley graph $BCay(G,S)$ is a graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(sx,2)}mid sin S, xin G}$. In this paper, we classify all finite groups admitting a connected cubic integral bi-Cayley graph.
متن کاملAnalysis of the Greedy List Coloring Algorithm on a Random Graph
As a special project for Spring and Summer 2007 David Pollard and I have been studying a graph coloring algorithm proposed by Achlioptas and Molloy (1997). By relying on heuristic arguments, they claimed to be able to find the probability of success for a proposed graph coloring algorithm on Erdös-Rényi graphs. This paper is a progress report detailing our attempts to rigorously derive similar ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2017
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.22224